Search results for "Boolean operations in computer-aided design"

showing 3 items of 3 documents

The expressive power of the shuffle product

2010

International audience; There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious operation on regular languages.Antonio Restivo proposed as a challenge to characterize the smallest class of languages containing the singletons and closed under Boolean operations, product and shuffle. This problem is still widely open, but we present some partial results on it. We also study some other smaller classes, including the smallest class containing the languages composed of a single word of length 2 which is closed under Boolean operations and shuffle by a letter (resp. shuffle by a l…

Class (set theory)Computer science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technologyStar (graph theory)01 natural sciencesExpressive powerTheoretical Computer ScienceRegular languageFormal language0202 electrical engineering electronic engineering information engineeringArithmeticAlgebraic numberComputingMilieux_MISCELLANEOUSDiscrete mathematicsComputer Science Applicationsshuffle operatorComputational Theory and Mathematics010201 computation theory & mathematicsProduct (mathematics)Formal language020201 artificial intelligence & image processingBoolean operations in computer-aided designWord (computer architecture)Information Systems
researchProduct

Nondeterministic Unitary OBDDs

2017

We investigate the width complexity of nondeterministic unitary OBDDs (NUOBDDs). Firstly, we present a generic lower bound on their widths based on the size of strong 1-fooling sets. Then, we present classically “cheap” functions that are “expensive” for NUOBDDs and vice versa by improving the previous gap. We also present a function for which neither classical nor unitary nondeterminism does help. Moreover, based on our results, we present a width hierarchy for NUOBDDs. Lastly, we provide the bounds on the widths of NUOBDDs for the basic Boolean operations negation, union, and intersection.

Discrete mathematicsHierarchy (mathematics)Intersection (set theory)010102 general mathematics0102 computer and information sciencesFunction (mathematics)Computer Science::Computational Complexity01 natural sciencesUpper and lower boundsUnitary stateNondeterministic algorithmCombinatoricsNegation010201 computation theory & mathematicsBoolean operations in computer-aided design0101 mathematicsMathematics
researchProduct

Boolean operations mediated by an ion-pair receptor of a multi-readout molecular logic gate

2013

A heteroditopic BODIPY dye that performs all basic Boolean operations with a cation (K+) and an anion (F-) as inputs and absorption, transmission and fluorescence as outputs is described. The molecular logic gate can also act as a digital comparator between the inputs.

Molecular logic gateMetal-IonsAnalytical chemistryTopologyCatalysisIonchemistry.chemical_compoundComplexDrivenMaterials ChemistryKeypad LockCrown EtherFluorescence EnhancementChemistryMetals and AlloysGeneral ChemistryIon pairsFluorescenceSurfaces Coatings and FilmsElectronic Optical and Magnetic MaterialsRecognitionTransmission (telecommunications)Ceramics and CompositesDigital comparatorInputsBoolean operations in computer-aided designBODIPY
researchProduct